A class of nonlinear elliptic problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Class of Nonlinear Elliptic Problems*

We obtain a strict coercivity estimate, (generalizing that of T. I. Seidman [J. Differential Equations 19 (1975), 242-2571 in considering spatial variation) for second order elliptic operators A: UH -V. y(.. Vu) with y “radial in the gradient”--y(., t)=a(., l[])i; for 5~ Iw”. The estimate is then applied to obtain existence of solutions of boundary value problems: -V t?(,, u, lVu[ ) Vu = f (., ...

متن کامل

A Class of Nonlinear Elliptic Boundary Value Problems

In this paper second order elliptic boundary value problems on bounded domains Ω ⊂ Rn with boundary conditions on ∂Ω depending nonlinearly on the spectral parameter are investigated in an operator theoretic framework. For a general class of locally meromorphic functions in the boundary condition a solution operator of the boundary value problem is constructed with the help of a linearization pr...

متن کامل

Existence of ground state solutions for a class of nonlinear elliptic equations with fast increasing weight

‎This paper is devoted to get a ground state solution for a class of nonlinear elliptic equations with fast increasing weight‎. ‎We apply the variational methods to prove the existence of ground state solution‎.

متن کامل

Nonlinear Elliptic Problems

with Aa having at most polynomial growth, by applying a general theorem concerning nonlinear functional equations in reflexive Banach spaces. Our result in [ l] extended and generalized results announced earlier by M. I. Visik [6; 7; 8] and obtained by more concrete analytic arguments. Visik's detailed account of his results which has just appeared in [9] has one feature which goes beyond the f...

متن کامل

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Equations

سال: 1985

ISSN: 0022-0396

DOI: 10.1016/0022-0396(85)90111-1